The weighted hook length formula
نویسندگان
چکیده
Abstract. Based on the ideas in [CKP], we introduce the weighted analogue of the branching rule for the classical hook length formula, and give two proofs of this result. The first proof is completely bijective, and in a special case gives a new short combinatorial proof of the hook length formula. Our second proof is probabilistic, generalizing the (usual) hook walk proof of Green-Nijenhuis-Wilf [GNW1], as well as the q-walk of Kerov [Ker1]. Further applications are also presented.
منابع مشابه
The Weighted Hook Length Formula III: Shifted Tableaux
Recently, a simple proof of the hook length formula was given via the branching rule. In this paper, we extend the results to shifted tableaux. We give a bijective proof of the branching rule for the hook lengths for shifted tableaux; present variants of this rule, including weighted versions; and make the first tentative steps toward a bijective proof of the hook length formula for d-complete ...
متن کاملThe weighted hook-length formula II: Complementary formulas
Let λ = (λ1, λ2, . . . , λl), λ1 ≥ λ2 ≥ . . . ≥ λl > 0, be a partition of n, λ ⊢ n, and let [λ] = {(i, j) ∈ Z : 1 ≤ i ≤ l, 1 ≤ j ≤ λi} be the corresponding Young diagram. The conjugate partition λ is defined by λj = max{i : λi ≥ j}. We will freely use implications such as i ≤ j ⇒ λi ≥ λj. The hook Hz ⊆ [λ] is the set of squares weakly to the right and below of z = (i, j) ∈ [λ], and the hook len...
متن کاملYet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
— We discover another one-parameter generalization of Postnikov's hook length formula for binary trees. The particularity of our formula is that the hook length h v appears as an exponent. As an application, we derive another simple hook length formula for binary trees when the underlying parameter takes the value 1/2.
متن کاملHook Length Polynomials for Plane Forests of a Certain Type
Abstract. The original motivation for study for hook length polynomials was to find a combinatorial proof for a hook length formula for binary trees given by Postnikov, as well as a proof for a hook length polynomial formula conjectured by Lascoux. In this paper, we define the hook length polynomial for plane forests of a given degree sequence type and show it can be factored into a product of ...
متن کاملBijective proofs of the hook formula for rooted trees
We present a bijective proof of the hook length formula for rooted trees based on the ideas of the bijective proof of the hook length formula for standard tableaux by Novelli, Pak and Stoyanovskii [10]. In section 4 we present another bijection for the formula. MR Subject Classification: 05A05,05A15
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 118 شماره
صفحات -
تاریخ انتشار 2011